� Suitability of Topological Data Structures for Data Parallel Operations in Computer Cartography
نویسنده
چکیده
High performance computing is rapidly evolving towards parallel processing . Among various issues in applying parallel processing to computer cartography, a major concern is the compatibility between parallel computational models and existing cartographic data structures as well as algorithms . This paper assesses the suitability of topological data structures for Data Parallel Processing in computer cartography. By mapping selected cartographic operations to the data parallel model, we found that topological data structures, with minor extensions, can support data parallel operations . The topological information stored in the cartographic database can be used as index vectors for segmented-scan and permutation . To demonstrate this approach, the paper describes data parallel implementations of three cartographic operations are described, including line generalization, point-in polygon search, and connectivity matrix construction . INTRODUCTION The motivation to conduct this research is three-fold . First, recent studies have shown the great potential of data parallel processing in computer cartography and GIS (Mower, 1992, 1993; Mills et al ., 1992a, 1992b ; Li,1993) . While most studies have been conducted in the raster domain, data parallel processing in the vector space has received less attention. Due to their spatial irregularity, cartographic operations in the vector domain are more difficult to adopt to the data parallel computational model. To perform data parallel processing, the vector space must be transformed to a regular one through specific decompositions such as the uniform grid (Franklin et al ., 1989; Fang and Piegl, 1993) . Although the uniform grid is a very efficient data structure for many vector operations, one of its drawbacks is the overhead to convert the data from and to their original structures . The conversion is necessary in the real world situations because few software packages for GIS and computer cartography use the uniform grid . It is therefore worthwhile to study the suitability of existing vector data structures for data parallel processing . Topological data structures are selected in this project because they are the most commonly used data structures in GIS software packages . Second, large scale applications of the parallel computing technology require "enabling technologies" that are based on existing hardware and software environment and allow flexible evolutions . Set aside other technical and economic conditions for using parallel computing, software developers would not adopt strategies that require fundamental changes in existing data
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملPAN graphs An aid to GIS analysis
Many data structures are possible for the storage of topological information for computer-based maps. The PAN graph is here suggested as an aid in the selection of a strategy appropriate to the application. Examples are given for the mapping of triangular networks and Thiessen polygons. Application of the technique is appropriate to both education in, and design of, spatial data structures for ...
متن کاملAn Intelligent Computer Interface Utilizing Parallel Picocontrollers (TECHNICAL NOTE)
The design of an interface unit is described, in which RS232 serial data is converted to latched parallel data on 22 independent lines. The data direction of each line is programmable through the serial port. Two picocontrollers are employed in a parallel processing mode to give the required number of I/O pins, and data on the shared serial line is coded to separate data streams to the individu...
متن کاملA topological data structure for hierarchical planar subdivisions
We introduce HPS a new topological data structure that e ciently represents hierarchies of planar subdivisions thus providing direct and e cient support for GIS concepts such as abstract generalizations and multi scale partitions Unlike previous ad hoc solutions HPS provides e cient access to adjacency information for each level and across levels while storing the complete hierarchy in a single...
متن کاملAn Outline of an Event-driven Spatial Data Structure for Managing Time-varying Maps
Traditional cartography, when managing change in the real world being mapped naturally turned to the time-slice concept: “This is what the real world looked like at date X”. Computer based replacements for manual techniques used the same approach. The reasons for preserving the time-slice mode! were partly for compatibility with previous operations, and partly because the computer methodologies...
متن کامل